Solving the linear multiple choice knapsack problem with two objectives: profit and equity

نویسنده

  • George Kozanidis
چکیده

Proof of Proposition 2 For clarity, we treat each option separately. Option A: Assume that the application of Option A is stopped at some point before an associated stopping condition is encountered. At that point, the increasing and decreasing slopes of all sets whose cost is not modified by the application of this option remain unchanged. Moreover, the upper sets remain upper, their decreasing slopes remain unchanged, and the increasing slope of the increasing set remains unchanged, too. Therefore, the ∆P ∆f ratios of Options A and D remain unchanged, too. Since Option A was selected for application at the beginning of the iteration, its ratio was not greater than the ratio of Option C, i.e., a−mo ≤ an− em m+ n =⇒ am+an−m2o−mno ≤ an−em =⇒ a+e ≤ mo+no =⇒ o ≥ a+ e m+ n . (1)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Linear Multiple Choice Knapsack Problem with Two Criteria: Profit and Equity

We study an extension of the Linear Multiple Choice Knapsack (LMCK) Problem that considers two criteria. The problem can be used to find the optimal allocation of an available resource to a group of disjoint sets of activities, while also ensuring that a certain balance on the resource amounts allocated to the activity sets is attained. The first criterion maximizes the profit incurred by the i...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

توسعه دو مدل ریاضی کارا برای مسئله کوله‏پشتی چند انتخابی فازی

 Multi-choice knapsack problem is a branch of regular knapsack problem where the objects are classified in different classes and each class has one and only one representative in final solution. Although it is assumed that each object belongs to just one class, sometimes this assumption is not valid in real problems. In this case an object may belong to the several classes. In fuzzy multi-choic...

متن کامل

A Knapsack-Based Approach to Bidding in Ad Auctions

We model the problem of bidding in ad auctions as a penalized multiple choice knapsack problem (PMCKP), a combination of the multiple choice knapsack problem (MCKP) and the penalized knapsack problem (PKP) [1]. We present two versions of PMCKP, GlobalPMCKP and LocalPMCKP, together with a greedy algorithm that solves the linear relaxation of a GlobalPMCKP optimally. We also develop a greedy heur...

متن کامل

A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem

Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comp. Opt. and Appl.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2009